Knowledge Knockout[Quiz Round](2nd-4th years)

What will be the resulting array after rotating

arr[]={1, 2, 3, 4, 5}

by 2?

• a) 2, 1, 3, 4, 5

• b) 3, 4, 5, 1, 2

• c) 4, 5, 1, 2, 3

• d) 1, 2, 3, 5, 4

For the given graph(G), which of the following statements is true?

• a) G is a complete graph

• b) G is not a connected graph

• c)The vertex connectivity of the graph is 2

• d) The edge connectivity of the graph is 1

What will be the output of the following Python function?

min(max(False,-3,-4), 2,7)

• -4

• -3

• 2

• False

What will be the output of the following Python code snippet?

print([i+j for i in "abc" for j in "def"])

• [‘da’, ‘ea’, ‘fa’, ‘db’, ‘eb’, ‘fb’, ‘dc’, ‘ec’, ‘fc’]

• [[‘ad’, ‘bd’, ‘cd’], [‘ae’, ‘be’, ‘ce’], [‘af’, ‘bf’, ‘cf’]]

• [[‘da’, ‘db’, ‘dc’], [‘ea’, ‘eb’, ‘ec’], [‘fa’, ‘fb’, ‘fc’]]

• [‘ad’, ‘ae’, ‘af’, ‘bd’, ‘be’, ‘bf’, ‘cd’, ‘ce’, ‘cf’]

Which data structure is used to implement Dijkstra's shortest path algorithm?

• Stack

• Queue

• Heap

• Linked List

The following formular is of

left_subtree (keys) < node (key) < right_subtree (keys)

• Complete Binary Tree

• Binary Tree

• All of these

• Binary Search Tree

Which of the following does this image depicts ?

• Complete Binary Tree

• Full Binary Tree

In a circular queue the value of r will be ..

• r= (r + 1) % [QUEUE_SIZE – 1]

• r = r + 1

• r = (r + 1) % QUEUE_SIZE

• r= (r - 1) % QUEUE_SIZE

What will be the output of this code?

• error

• 0 3 1

• 2 1

• None of these

print(True ** False / True) 

What will be the output of this program?

• True ** False / True

• 1 ** 0 / 1

• 0.0

• 1.0